Page 1 Next

Displaying 1 – 20 of 42

Showing per page

.121221222... is not quadratic.

Florian Luca (2005)

Revista Matemática Complutense

In this note, we show that if b > 1 is an integer, f(X) ∈ Q[X] is an integer valued quadratic polynomial and K > 0 is any constant, then the b-adic number ∑n≥0 (an / bf(n)), where an ∈ Z and 1 ≤ |an| ≤ K for all n ≥ 0, is neither rational nor quadratic.

(Non)Automaticity of number theoretic functions

Michael Coons (2010)

Journal de Théorie des Nombres de Bordeaux

Denote by λ ( n ) Liouville’s function concerning the parity of the number of prime divisors of n . Using a theorem of Allouche, Mendès France, and Peyrière and many classical results from the theory of the distribution of prime numbers, we prove that λ ( n ) is not k –automatic for any k > 2 . This yields that n = 1 λ ( n ) X n 𝔽 p [ [ X ] ] is transcendental over 𝔽 p ( X ) for any prime p > 2 . Similar results are proven (or reproven) for many common number–theoretic functions, including ϕ , μ , Ω , ω , ρ , and others.

Currently displaying 1 – 20 of 42

Page 1 Next